Lower Bound of Face Guards of Polyhedral Terrains

Optimization of polyhedral terrains

Guarding Polyhedral Terrains

We prove that [n/2J vertex guards are always sufficient and sometimes necessary to guard the surface of an n-vertex polyhedral terrain. We also show that l(4n 4)/13J edge guards are sometimes necessary to guard the surface of an n-vertex polyhedral terrain. The upper bound on the number of edge guards is ln/3J (Everett and Rivera-Campo, 1994). Since both upper bounds are based on the four color...

Generalized Voronoi Diagrams on Polyhedral Terrains

We present an algorithm for computing exact shortest paths, and consequently distances, from a generalized source (point, segment, polygonal chain or polygonal region) on a polyhedral terrain in which polygonal chain or polygon obstacles are allowed. We also present algorithms for computing discrete Voronoi diagrams of a set of generalized sites (points, segments, polygonal chains or polygons) ...

On the Number of Views of Polyhedral Terrains

We show that the number of topologically different orthographic views of a polyhedral terrain with n edges is O(n 5 +~), and that the number of topologically different perspective views of such a terrain is O(nS+0, for any e > 0. Both bounds are almost tight in the worst case. The proofs are simple consequences of the recent almost-tight bounds of [11] on the complexity of lower envelopes in hi...

Visibility-based Distributed Deployment of Robotic Teams in Polyhedral Terrains

This paper presents deployment strategies for a team of multiple mobile robots with line-of-sight visibility in 1.5D and 2.5D terrain environments. Our objective is to distributively achieve full visibility of a polyhedral environment. In the 1.5D polyhedral terrain, we achieve this by determining a set of locations that the robots can distributively occupy. In the 2.5D polyhedral terrain, we a...